Fuzzy Logic Based Logical Query Answering on Knowledge Graphs
نویسندگان
چکیده
Answering complex First-Order Logical (FOL) queries on large-scale incomplete knowledge graphs (KGs) is an important yet challenging task. Recent advances embed logical and KG entities in the same space conduct query answering via dense similarity search. However, most operators designed previous studies do not satisfy axiomatic system of classical logic, limiting their performance. Moreover, these are parameterized thus require many FOL as training data, which often arduous to collect or even inaccessible real-world KGs. We present FuzzQE, a fuzzy logic based embedding framework for over FuzzQE follows define principled learning-free manner, where only entity relation embeddings learning. can further benefit from labeled training. Extensive experiments two benchmark datasets demonstrate that provides significantly better performance compared state-of-the-art methods. In addition, trained with link prediction achieve comparable those extra data.
منابع مشابه
Logic-Based Integration of Query Answering and Knowledge Discovery
There is currently great interest in integrating knowledge discovery research into mainstream database systems. Such an enterprise is nontrivial because knowledge discovery and database systems are rooted in different paradigms, therefore foundational work needs to be carried out and a candidate unified syntax and semantics needs to be proposed. Elsewhere we have indeed carried out such foundat...
متن کاملA top-k query answering procedure for fuzzy logic programming
We present a top-k query answering procedure for Fuzzy Logic Programming, in which arbitrary computable functions may appear in the rule bodies to manipulate truth values. The top-k ranking problem, i.e. determining the top k answers to a query, becomes important as soon as the set of facts becomes quite large. © 2012 Elsevier B.V. All rights reserved.
متن کاملExplaining Inconsistency-Tolerant Query Answering over Description Logic Knowledge Bases
Several inconsistency-tolerant semantics have been introduced for querying inconsistent description logic knowledge bases. This paper addresses the problem of explaining why a tuple is a (non-)answer to a query under such semantics. We define explanations for positive and negative answers under the brave, AR and IAR semantics. We then study the computational properties of explanations in the li...
متن کاملTowards Temporal Fuzzy Query Answering on Stream-based Data
For reasoning over streams of data ontology-based data access is a common approach. The method for answering conjunctive queries (CQs) over DL-Lite ontologies in this setting is by rewritings of the query and evaluation of the resulting query by a data base engine. For streambased applications the classical expressivity of DL-Lite lacks means to handle fuzzy and temporal information. In this pa...
متن کاملOWL Query Answering Based on Query Extension
The paper presents an approach for optimizing query answering algorithms that are based on approximate instance retrieval. We consider SPARQL instance queries over OWL ontologies and use the OWL 2 Direct Semantics entailment regime of SPARQL for their evaluation. Approximate query answering algorithms are based on the creation of two sets; the set of certain or known query answers and the set o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence
سال: 2022
ISSN: ['2159-5399', '2374-3468']
DOI: https://doi.org/10.1609/aaai.v36i4.20310